An algorithm for solving the multi-period online fulfillment assignment problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولSolving the Multi Depot Vehicle Routing Problem with Assignment Algorithm
The Vehicle Routing Problem (VRP) involves the design of a set of minimum cost vehicle routes, originating and terminating at a central depot, for a fleet of vehicles that services a set of customers with known demands. This study contains some information about Logistics and Supply Chain Management. In the second part Distribution Management, which is a more related subject with Vehicle Routin...
متن کاملAn Adapted Non-dominated Sorting Algorithm (ANSA) for Solving Multi Objective Trip Distribution Problem
Trip distribution deals with estimation of trips distributed among origins and destinations and is one of the important stages in transportation planning. Since in the real world, trip distribution models often have more than one objective, multi-objective models are developed to cope with a set of conflict goals in this area. In a proposed method of adapted non-dominated sorting algorithm (ANS...
متن کاملAn efficient solution algorithm for solving multi-class reliability-based traffic assignment problem
The multi-class reliability-based user equilibrium (RUE) problem has been intensively studied in recent years, as it can capture the route choice behaviors of users with heterogeneous risk-aversion under demand and supply uncertainties. Few solution algorithms, however, are available for solving the RUE problems in large-scale road networks. This is mainly due to the non-additive property of th...
متن کاملAn algorithm for multi-objective job shop scheduling problem
Scheduling for job shop is very important in both fields of production management and combinatorial op-timization. However, it is quite difficult to achieve an optimal solution to this problem with traditional opti-mization approaches owing to the high computational complexity. The combination of several optimization criteria induces additional complexity and new problems. In this paper, we pro...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematical and Computer Modelling
سال: 2009
ISSN: 0895-7177
DOI: 10.1016/j.mcm.2009.04.024